Nearlattices Whose Sets of Principal <i>n</i>-ideals Form Relatively Normal Nearlattices
نویسندگان
چکیده
منابع مشابه
On Semi Prime Ideals in Nearlattices
Recently Yehuda Rav has given the concept of Semi prime ideals in a general lattice by generalizing the notion of 0-distributive lattices. In this paper we study several properties of these ideals in a general nearlattice and include some of their characterizations. We give some results regarding maximal filters and include a number of Separation properties in a general nearlattice with respect...
متن کاملCharacterizations of m - Normal Nearlattices in terms of Principal n - Ideals
A convex subnearlattice of a nearlattice S containing a fixed element n∈S is called an n-ideal. The n-ideal generated by a single element is called a principal n-ideal. The set of finitely generated principal nideals is denoted by Pn(S), which is a nearlattice. A distributive nearlattice S with 0 is called m-normal if its every prime ideal contains at most m number of minimal prime ideals. In t...
متن کاملCharacterizations of relative n-annihilators of nearlattices
In this paper we have introduced the notion of relative n-annihilators around a fixed element n of a nearlattice S which is used to generalize several results on relatively nearlattices. We have also given some characterizations of distributive and modular nearlattices in terms of relative nannihilators.
متن کاملDominating sets whose closed stars form spanning trees
For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W . If there exists a W such that S(W ) is a tree containing all the vertices of G, then S(W ) is a spanning star tree of G. These and associated notions are related to connected and/or acyclic domin...
متن کاملPartitions whose parts are pairwise relatively prime
The following problem arose in connection with our research in statistical group theory: estimate a, := the number of partitions of n into parts that are pairwise relatively prime. This differs from most problems in the theory of partitions because of the complicated relationship between the part sixes. We obtain an asymptotic formula for log a,, but leave open the challenging task of obtaining...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Research
سال: 2010
ISSN: 2070-0245,2070-0237
DOI: 10.3329/jsr.v3i1.3955